Hardy-like quantum pigeonhole paradox and the projected-coloring graph state

نویسندگان

چکیده

A Hardy-like version of the quantum pigeonhole paradox is proposed, which can also be considered as a special kind Hardy's paradox. Besides an example induced from minimal system, general construction this $n$-qubit state discussed. Moreover, by introducing projected-coloring graph and state, pictorial representation presented. This implemented more directly in experiment than original one, since it does not require some sophisticated techniques such weak measurements. In addition, angle paradox, paradoxes even set new record for success probability demonstrating Bell nonlocality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

Experimental observation of Hardy-like quantum contextuality.

Contextuality is a fundamental property of quantum theory and a critical resource for quantum computation. Here, we experimentally observe the arguably cleanest form of contextuality in quantum theory [A. Cabello et al., Phys. Rev. Lett. 111, 180404 (2013)] by implementing a novel method for performing two sequential measurements on heralded photons. This method opens the door to a variety of f...

متن کامل

Graph Coloring Using State Space Search

As a subject with many applications, graph coloring is one of the most studied NP-hard problems. Due to its time complexity, graph coloring is an excellent candidate for implementation with a parallelized architecture, and as such has become our choice for our project. Of the many ways that graph coloring can be adapted for parallel programming there are two main approaches in literature: the i...

متن کامل

On the Maximum Number of Dominating Classes in Graph Coloring

In this paper we investigate the dominating- -color number،  of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].  

متن کامل

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2022

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.105.032457